Determining maximal efficient faces in multiobjective linear programming problem
نویسندگان
چکیده
منابع مشابه
Finding all maximal efficient faces in multiobjective linear programming
An algorithm for finding the whole efficient set of a multiobjective linear program is proposed. From the set of efficient edges incident to a vertex, a characterization of maximal efficient faces containing the vertex is given. By means of the lexieographic selection rule of Dantzig, Orden and Wolfe, a connectedness property of the set of dual optimal bases associated to a degenerate vertex is...
متن کاملMaximal and supremal tolerances in multiobjective linear programming
Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the computed intervals. The known methods yield tolerances that are not optimal. In this paper, we propose ...
متن کاملLinear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کاملSensitivity analysis in fuzzy multiobjective linear fractional programming problem
In this paper, we study measurement of sensitivity for changes of violations in the aspiration level for the fuzzy multiobjective linear fractional programming problem. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملDetermination of the Efficient Set in Multiobjective Linear Programming
This paper develops a method for finding the whole set of efficient points of a multiobjective linear problem. Two algorithms are presented; the first one describes the set of all efficient vertices and all efficient rays of the constraint polyhedron, while the second one generates the set of all efficient faces. The method has been tested on several examples for which numerical results are rep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2009
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2008.11.063